An example of general recursive well-ordering which is not primitive recursive
نویسندگان
چکیده
منابع مشابه
A class of Recursive Permutations which is Primitive Recursive complete
We focus on total functions in the theory of reversible computational models. We define a class of recursive permutations, dubbed Reversible Primitive Permutations (RPP) which are computable invertible total endo-functions on integers, so a subset of total reversible computations. RPP is generated from five basic functions (identity, negation, successor, predecessor, swap), two notions of compo...
متن کاملPrimitive Recursive Functions
1. Definition of recursive functions. In this paper, we shall consider certain reductions in the recursion scheme for defining primitive recursive functions. Hereafter, we shall refer to such functions simply as recursive functions. In §1, we define what is meant by a recursive function, and also define some recursive functions which will be used. The statement of the principal results of the p...
متن کاملDeciding DPDA Equivalence Is Primitive Recursive
Recently Sénizergues showed decidability of the equivalence problem for deterministic pushown automata. The proof of decidability is two semi-decision procedures that do not give a complexity upper bound for the problem. Here we show that there is a simpler deterministic decision procedure that has a primitive recursive upper bound.
متن کاملExtended Primitive Recursive Functions
— In this paper we extend the notion of primitive recursive function to the case in which the domain is N* and the range is a subset oj N*. We give a rigorvus characterization oj tins class oj functions and show différences icith the classical primitive recursive functions. Résumé. — Dans cette note nous étendons la notion de f onction primitive recursive à tous les cas dans lesquels le domaine...
متن کاملUnary Primitive Recursive Functions
In this article, we will study certain reductions in the schemes that conform unary primitive recursive functions (i.e. primitive recursive functions of one argument) and we will extend some results previously researched by R. M. Robinson in [15]. Furthermore, we will introduce formal notation for unary primitive recursive functions. §
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tohoku Mathematical Journal
سال: 1960
ISSN: 0040-8735
DOI: 10.2748/tmj/1178244438